A separation between tropical matrix ranks

نویسندگان

چکیده

We continue to study the rank functions of tropical matrices. In this paper, we explain how reduce computation ranks for matrices over ‘supertropical semifield’ standard case. Using a counting approach, prove existence 01 01 -matrix with many ones and without large all-one submatrices, put our results together construct an alttext="n times n"> n × encoding="application/x-tex">n\times n matrix alttext="o left-parenthesis n Superscript 0.5 plus epsilon Baseline right-parenthesis"> o ( 0.5 + ε stretchy="false">) encoding="application/x-tex">o(n^{0.5+\varepsilon }) Kapranov minus o −<!-- − encoding="application/x-tex">n-o(n) .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Displacement Ranks of a Matrix

The solution of many problems in physics and engineering reduces ultimately to the solution of linear equations of the form Ra = m, where JR and m are given N x N and N x 1 matrices and a is to be determined. Here our concern is with the fact that it generally takes 0(N) computations (one computation being the multiplication of two real numbers) to do this, and this might be a substantial burde...

متن کامل

On tropical and Kapranov ranks of tropical matrices

Let M be a tropical matrix (k + x) × (k + x ′) for some k, x , x ′ ∈ N − {0} with tropical rank k. We show that Kapranov rank is k too if x and x ′ are not too big; namely if we are in one of the following cases: a) k ≥ 6 and x , x ′ ≤ 2 b) k = 4, 5, x ≤ 2 and x ′ ≤ 3 (or obviuosly the converse, that is x ≤ 3 and x ′ ≤ 2) c) k = 3 and either x , x ′ ≤ 3 or x ≤ 2 and x ′ ≤ 4 (or obviuosly the co...

متن کامل

The Tropical Rank of a Tropical Matrix

In this paper we further develop the theory of matrices over the extended tropical semiring. Introducing a notion of tropical linear dependence allows for a natural definition of matrix rank in a sense that coincides with the notions of tropical regularity and invertibility.

متن کامل

On the complexity of Boolean matrix ranks

We construct a reduction which proves that the fooling set number and the determinantal rank of a Boolean matrix are NP-hard to compute. This note is devoted to the functions of determinantal rank and fooling set number, which are receiving attention in different applications, see [1, 3] and references therein. The purpose of this note is to give an NP-completeness proof for those functions, th...

متن کامل

Inequalities Between Ranks and Cranks

Higher moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves the first several cases of (and strengthens) a conjecture due to Garvan, which states that the moments of the crank function are always larger than the moments of the crank f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2022

ISSN: ['2330-1511']

DOI: https://doi.org/10.1090/proc/16156